منابع مشابه
Partitioned Probe Comparability Graphs
Given a class of graphs G, a graphG is a probe graph of G if its vertices can be partitioned into a set of probes and an independent set of nonprobes such that G can be embedded into a graph of G by adding edges between certain nonprobes. If the partition of the vertices is part of the input, we call G a partitioned probe graph of G. In this paper we show that there exists a polynomial-time alg...
متن کاملTwo characterizations of chain partitioned probe graphs
Chain graphs are exactly bipartite graphs without induced 2K 2 (a graph with four vertices and two disjoint edges). A graph G = (V, E) with a given independent set S ⊆ V (a set of pairwise non-adjacent vertices) is said to be a chain partitioned probe graph if G can be extended to a chain graph by adding edges between certain vertices in S. In this note we give two characterizations for chain p...
متن کاملComparability graphs and intersection graphs
A function diagram (f-diagram) D consists of the family of curves {i, . . . , ii} obtained from n continuous functions fi : [O, 1] -B R (1 G i d n). We call the intersection graph of D a function graph (f-graph). It is shown that a graph G is an f-graph if and only if its complement 0 is a comparability graph. An f-diagram generalizes the notion cf a permutation diagram where the fi are linear ...
متن کاملTreelike Comparability Graphs
A comparability graph is a simple graph which admits a transitive orientation on its edges. Each one of such orientations defines a poset on the vertex set, and also it is said that this graph is the comparability graph of the poset. A treelike poset is a poset whose covering graph is a tree. Comparability graphs of arborescence posets are known as trivially perfect graphs. These have been char...
متن کاملDomination in partitioned graphs
Let V1, V2 be a partition of the vertex set in a graph G, and let γi denote the least number of vertices needed in G to dominate Vi. We prove that γ1 + γ2 ≤ 45 |V (G)| for any graph without isolated vertices or edges, and that equality occurs precisely if G consists of disjoint 5-paths and edges between their centers. We also give upper and lower bounds on γ1 + γ2 for graphs with minimum valenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.01.038